Towards a flow theory for the dichromatic number

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards a flow theory for the dichromatic number

We transfer the ideas of analyzing the chromatic number of a graph using nowherezero-coflows and -flows to digraphs and the dichromatic number.

متن کامل

Dichromatic Number and Fractional Chromatic Number

The dichromatic number of a graph G is the maximum integer k such that there exists an orientation of the edges of G such that for every partition of the vertices into fewer than k parts, at least one of the parts must contain a directed cycle under this orientation. In 1979, Erdős and NeumannLara conjectured that if the dichromatic number of a graph is bounded, so is its chromatic number. We m...

متن کامل

Critical Flow – towards a Construction Flow Theory

This paper introduces the concept of Construction Physics as a more comprehensive way of understanding the construction process from a flow perspective. It establishes a preliminary definition of the term and investigates briefly the present knowledge, flow models and methods for their management. From this it argues that the state of the art does not fully cover the whole process and proposes ...

متن کامل

Pk-freeness implies small dichromatic number

We propose a purely combinatorial quadratic time algorithm that for any n-vertex Pk-free tournament T , where Pk is a directed path of length k, finds in T a transitive subset of order n c k log(k)2 . As a byproduct of our method, we obtain subcubic O(n 1− c k log(k)2 )-approximation algorithm for the optimal acyclic coloring problem on Pk-free tournaments. Our results are tight up to the log(k...

متن کامل

Enumeration and dichromatic number of tame tournaments

The concept of molds, introduced by the authors in a recent preprint, break regular tournaments naturally into big classes: cyclic tournaments, tame tournaments and wild tournaments. We enumerate completely the tame molds, and prove that the dichromatic number of a tame tournament is 3.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Discrete Mathematics

سال: 2015

ISSN: 1571-0653

DOI: 10.1016/j.endm.2015.06.016